Proof Systems for Institutional Logic

نویسنده

  • Razvan Diaconescu
چکیده

Institutions with proof-theoretic structure, here called ‘institutions with proofs’, provide a complete formal notion for the intuitive notion of logic, including both the model and the proof theoretic sides. This paper introduces a concept of proof rules for institutions and argues that the proof systems of the actual institutions with proofs are freely generated by their presentations as systems of proof rules. We also show that proof-theoretic quantification, an institutional refinement of the (meta-)rule of Generalization from classical logic, can also be added freely to any proof system. By applying these universal properties, we are able to provide some general compactness results for proof systems and some general soundness results for institutions with proofs. We also discuss several open problems and further research directions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Personalisation - An Emergent Institutional Logic in Healthcare?; Comment on “(Re) Making the Procrustean Bed? Standardization and Customization as Competing Logics in Healthcare”

This commentary on the recent think piece by Mannion and Exworthy reviews their core arguments, highlighting their suggestion that recent forces for personalization have emerged which may counterbalance the strong standardization wave which has been evident in many healthcare settings and systems over the last two decades. These forces for personalization can take very different forms. The comm...

متن کامل

Some Institutional Requirements for Temporal Reasoning on Dynamic Reconfiguration of Component Based Systems

We study a logic adapted for the purpose of specifying component based systems with support for run time reconfiguration. In particular, we analyse some institutional properties of this logic, related to compositional reasoning in specifications. The logic is an adaptation of the Manna-Pnueli logic, a first-order temporal logic originally proposed to describe reactive systems. We present our va...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers

This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...

متن کامل

On focusing and polarities in linear logic and intuitionistic logic

There are a number of cut-free sequent calculus proof systems known that are complete for first-order intuitionistic logic. Proofs in these different systems can vary a great deal from one another. We are interested in providing a flexible and unifying framework that can collect together important aspects of many of these proof systems. First, we suggest that one way to unify these proof system...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2006